منابع مشابه
Discrete Loops and Worst Case Performance
In this paper so-called discrete loops are introduced which narrow the gap between general loops (e.g. while-or repeat-loops) and for-loops. Although discrete loops can be used for applications that would otherwise require general loops, discrete loops are known to complete in any case. Furthermore it is possible to determine the number of iterations of a discrete loop, while this is trivial to...
متن کاملWorst-case Compressibility of Discrete and Finite Distributions
In the worst-case distributed source coding (DSC) problem of [1], the smaller cardinality of the support-set describing the correlation in informant data, may neither imply that fewer informant bits are required nor that fewer informants need to be queried, to finish the data-gathering at the sink. It is important to formally address these observations for two reasons: first, to develop good wo...
متن کاملBounding Worst-Case Instruction Cache Performance
The use of caches poses a difficult tradeoff for architects of real-time systems. While caches provide significant performance advantages, they have also been viewed as inherently unpredictable since the behavior of a cache reference depends upon the history of the previous references. The use of caches will only be suitable for realtime systems if a reasonably tight bound on the performance of...
متن کاملHow to Achieve Worst-Case Performance
\Average case performance" is an oft-cited motivation for self-timed design. In self-timed designs, computations proceed according to handshakes, and these handshakes can reeect the actual time required for operations rather than the worst-case time. The intuitive argument is that this should lead to systems whose performance reeects the average-case performance of their components. This paper ...
متن کاملComputing Stable Models: Worst-Case Performance Estimates
We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than the trivial bound of O(m2n), where m is the size of an input program and n is the number of its atoms. For instance, for programs, whose clauses consist of at most two literals (counting the head) we design an algorithm to compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Languages
سال: 1994
ISSN: 0096-0551
DOI: 10.1016/0096-0551(94)90004-3